MPILS: An automatic tuner for MILP solvers

نویسندگان

چکیده

The parameter configuration problem consists of finding a that gives particular algorithm the best performance. This paper introduces new multi-phase tuner based on iterated local search meta-heuristic. addresses for deterministic MILP solvers are used to solve challenging industrial optimization problems. Further, proposed offers strategy three ideas. First, instead tuning in entire space induced by set, focuses small pool is dynamically enriched with promising parameters. Second, it leverages gathered knowledge during using statistical learning forbid less combinations. Third, tunes single instance provided earlier clustering instances. A computational study widely-used commercial solver CPLEX instances from MIPLIB library and real large-scale highlights potential tuner.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Handling software upgradeability problems with MILP solvers

Upgradeability problems are a critical issue in modern operating systems. The problem consists in finding the “best” solution according to some criteria, to install, remove or upgrade packages in a given installation. This is a difficult problem: the complexity of the upgradeability problem is NP complete and modern OS contain a huge number of packages (often more than 20 000 packages in a Linu...

متن کامل

An MILP Based Algorithm for Automatic System Level Synthesis

Automatic Synthesis of large realtime systems using an array of oo-the-shelf general purpose processors, digital signal processors and Field Programmable Gate Arrays is increasingly gaining importance. Each of the subproblems in such a synthesis process, namely, pipelining, resource type selection, resource allocation, resource assignment, resource scheduling and resource re-connguration are co...

متن کامل

Automatic Implication Checking for CHR Constraint Solvers

Constraint Handling Rules (CHRs) are a high-level rule-based programming language commonly used to define constraint solvers. We present a method for automatic implication checking between constraints of CHR solvers. Our method does not copy the entire constraint store, but performs the check in place using a trailing mechanism. The necessary code enhancements can be done by automatic program t...

متن کامل

An Approach for Automatic Matching of Descriptive Addresses

Address matching (also called geocoding) is an applied spatial analysis which is frequently used in everyday life. Almost all desktop and web-based GIS environments are equipped with a module to match the addresses expressed in pre-defined standard formats on the map. It is an essential prerequisite for many of the functionalities provided by location-based services (e.g. car navigation). Sever...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2023

ISSN: ['0305-0548', '1873-765X']

DOI: https://doi.org/10.1016/j.cor.2023.106344